Bi-connected Gauss–Bonnet gravity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connected Correlators in Quantum Gravity

We discuss the concept of connected, reparameterization invariant matter correlators in quantum gravity. We analyze the effect of discretization in two solvable cases : branched polymers and two-dimensional simplicial gravity. In both cases the naively defined connected correlators for a fixed volume display an anomalous behavior, which could be interpreted as a long-range order. We suggest tha...

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

On Connected Bi-partitions of a Graph

We explore the connected bi-partitions of a graph i.e. spanning subgraphs of a graph which consist of exactly two connected components. We then relate the bi-partitions to the elements of the Moore-Penrose pseudoinverse of the graph Laplacian (L). Moreover, we establish a topological interpretation for the effective resistance metric and the so called Kirchoff index for the graph in terms of th...

متن کامل

Bi-metric Gravity and " Dark Matter "

We present a bi-metric theory of gravity containing a length scale of galactic size. For distances less than this scale the theory satisfies the standard tests of General Relativity. For distances greater than this scale the theory yields an effective gravitational constant much larger than the locally observed value of Newton's constant. The transition from one regime to the other through the ...

متن کامل

Path Planning for Multiple Robots in Bi-connected Environments

This paper addresses a problem of path planning for multiple robots. A class of the problem with bi-connected environments is defined and a new polynomial-time solving algorithm for this class is proposed. It is shown in the paper that the new algorithm significantly outperforms the existing state-of-the-art domain-independent approaches and it is able to solve problems of real-life size. Intro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: General Relativity and Gravitation

سال: 2015

ISSN: 0001-7701,1572-9532

DOI: 10.1007/s10714-015-1885-5